A Min-Max Point Seeking Method for an Unknown Multi-Dimensional Function with Several Saddle Points

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SADDLE POINT VARIATIONAL METHOD FOR DIRAC CONFINEMENT

A saddle point variational (SPV ) method was applied to the Dirac equation as an example of a fully relativistic equation with both negative and positive energy solutions. The effect of the negative energy states was mitigated by maximizing the energy with respect to a relevant parameter while at the same time minimizing it with respect to another parameter in the wave function. The Cornell pot...

متن کامل

Saddle Point Seeking for Convex Optimization Problems

In this paper, we consider convex optimization problems with constraints. By combining the idea of a Lie bracket approximation for extremum seeking systems and saddle point algorithms, we propose a feedback which steers a single-integrator system to the set of saddle points of the Lagrangian associated to the convex optimization problem. We prove practical uniform asymptotic stability of the se...

متن کامل

Saddle-Point Dynamics: Conditions for Asymptotic Stability of Saddle Points

This paper considers continuously differentiable functions of two vector variables that have (possibly a continuum of) min-max saddle points. We study the asymptotic convergence properties of the associated saddle-point dynamics (gradient-descent in the first variable and gradientascent in the second one). We identify a suite of complementary conditions under which the set of saddle points is a...

متن کامل

An interior point method for constrained saddle point problems

We present an algorithm for the constrained saddle point problem with a convexconcave function L and convex sets with nonempty interior. The method consists of moving away from the current iterate by choosing certain perturbed vectors. The values of gradients of L at these vectors provide an appropriate direction. Bregman functions allow us to define a curve which starts at the current iterate ...

متن کامل

An Effective Learning Method for Max-Min Neural Networks

Max and min operations have interesting properties that facilitate the exchange of information between the symbolic and real-valued domains. As such, neural networks that employ max-min activation functions have been a subject of interest in recent years. Since max-min functions are not strictly di f ferent iate, we propose a mathematically sound learning method based on using Fourier convergen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers

سال: 1975

ISSN: 0453-4654

DOI: 10.9746/sicetr1965.11.418